On the Component Number of Links from Plane Graphs
نویسندگان
چکیده
Using the Dehn presentation of a link group, a short elementary proof is given of the result: The number of components of a link arising from a medial graph M( ) by resolving vertices is equal to the nullity of the mod-2 Laplacian matrix of .
منابع مشابه
Reliability Analysis of FSO Communication Links Using Aberrated Divergent rectangular Partially Coherent Flat- Topped Beam
The effects of aberration on the Bit-Error-Rate (BER) and reliability of free- space optical (FSO) communication links are investigated. Based on aberrated divergent rectangular partially coherent flat-topped beam formula on the receiver plane and considering the atmosphere losses due to absorption and scattering, numerical values for Power In Bucket (PIB), Signal to Noise Ratio (SNR) and BER a...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملEffect of Variable Thermal Conductivity and the Inclined Magnetic Field on MHD Plane Poiseuille Flow in a Porous Channel with Non-Uniform Plate Temperature
The aim of this paper is to investigate the effect of the variable thermal conductivity and the inclined uniform magnetic field on the plane Poiseuille flow of viscous incompressible electrically conducting fluid between two porous plates Joule heating in the presence of a constant pressure gradient through non-uniform plate temperature. It is assumed that the fluid injection occurs at lower pl...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کامل